Shortest path problem

Results: 829



#Item
211Robot control / Search algorithms / Rapidly-exploring random tree / Motion planning / Algorithm / Asymptotic computational complexity / Asymptotically optimal algorithm / Probabilistic roadmap / Shortest path problem / Applied mathematics / Mathematics / Theoretical computer science

Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula

Add to Reading List

Source URL: iros2011.org

Language: English - Date: 2011-09-21 07:00:30
212Network theory / Graph connectivity / Connectivity / Cut / Graph / Maximum flow problem / Shortest path problem / Graph theory / Mathematics / Theoretical computer science

Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2012-04-26 12:04:26
213Network theory / Shortest path problem / Randomized algorithm / Connectivity / Graph theory / Networks / Theoretical computer science / Mathematics / Computational complexity theory

Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University Deepayan Chakrabarti

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2011-03-01 02:05:39
214Network theory / Geodesic / Distance / Differential geometry of surfaces / Shortest path problem / Vertex / Polygonal chain / Homotopy / Medial axis / Mathematics / Geometry / Graph theory

PDF Document

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2013-08-11 21:51:56
215Combinatorics on words / String matching algorithms / Fibonacci heap / Knuth–Morris–Pratt algorithm / Shortest path problem / String / Substring / Algorithm / Heap / Mathematics / Combinatorics / Fibonacci numbers

CS 373: Combinatorial Algorithms, Fall 2000 Homework 4 (due October 26, 2000 at midnight) Name: Net ID:

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:48:13
216Steiner tree problem / Shortest path problem / Routing algorithms / Euclidean plane geometry / Operations research / Graph theory / Theoretical computer science / Mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximate Shortest Descent Path on a Terrain Sasanka Roy∗ , Sachin Lodha∗, Sandip Das† and Anil Maheshwari‡ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:24:07
217Physics / Classical mechanics / Combinatorial optimization / Routing algorithms / Search algorithms / Inverse kinematics / Motion planning / Kinematics / Shortest path problem / Robot kinematics / Mathematics / Applied mathematics

3D Motion Planning Algorithms for Steerable Needles Using Inverse Kinematics Vincent Duindam1 , Jijie Xu2 , Ron Alterovitz1,3 , Shankar Sastry1 , and Ken Goldberg1,2 1

Add to Reading List

Source URL: www.ieor.berkeley.edu

Language: English - Date: 2008-10-16 10:19:33
218Heuristics / Theoretical computer science / Operations research / Abstraction / Search algorithm / Shortest path problem / Algorithm / Lambda calculus / Mathematical optimization / Mathematics / Applied mathematics / Problem solving

Refining abstraction heuristics with mutexes Bachelor thesis Natural Science Faculty of the University of Basel Department of Computer Science

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29
219Discrete geometry / Euclidean plane geometry / Shortest path problem / Mathematical optimization / Mathematics / Theoretical computer science / Arrangement of lines

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On Shortest Paths in Line Arrangements T. Kavitha∗ Abstract

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-01-08 18:44:30
220Science / Heuristic function / Admissible heuristic / Heuristic / Abstraction / Consistent heuristic / Friedrich Robert Helmert / Algorithm / Shortest path problem / Heuristics / Mathematics / Applied mathematics

Additive Counterexample-guided Cartesian Abstraction Refinement Jendrik Seipp and Malte Helmert Universit¨at Basel Basel, Switzerland {jendrik.seipp,malte.helmert}@unibas.ch

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-06-05 11:45:20
UPDATE